Ergodic Transformations in the Space of p-adic Integers
نویسنده
چکیده
Let L1 be the set of all mappings f : Zp → Zp of the space of all p-adic integers Zp into itself that satisfy Lipschitz condition with a constant 1. We prove that the mapping f ∈L1 is ergodic with respect to the normalized Haar measure on Zp if and only if f induces a single cycle permutation on each residue ring Z/pZ modulo p, for all k = 1,2,3, . . .. The multivariate case, as well as measure-preserving mappings, are considered also. Results of the paper in a combination with earlier results of the author give explicit description of ergodic mappings from L1. This characterization is complete for p = 2. As an application we obtain a characterization of polynomials (and certain locally analytic functions) that induce ergodic transformations of p-adic spheres. The latter result implies a solution of a problem (posed by A. Khrennikov) about the ergodicity of a perturbed monomial mapping on a sphere.
منابع مشابه
algebraic and arithmetic dynamics bibliographical database
References [1] S. Akiyama, T. Borbéli, H. Brunotte, A. Pethö, and J. Thuswaldner. Generalized radix representations and dynamical systems i. Acta Math. Hungarica., 108:207–238, 2005. [2] S. Akiyama, H. Brunotte, A. Pethö, and J. Thuswaldner. Generalized radix representations and dynamical systems ii. Acta Arith., 121:21–61, 2006. [3] S. Akiyama and N Gjini. On the connectedness of self-affine a...
متن کاملPseudorandom number generation by p-adic ergodic transformations: an addendum
The paper study counter-dependent pseudorandom number generators based on m-variate (m > 1) ergodic mappings of the space of 2-adic integers Z2. The sequence of internal states of these generators is defined by the recurrence law xi+1 = H B i (xi) mod 2 n, whereas their output sequence is zi = F B i (xi) mod 2 n; here xj , zj are m-dimensional vectors over Z2. It is shown how the results obtain...
متن کاملAutomata finiteness criterion in terms of van der Put series of automata functions
In the paper we develop the p-adic theory of discrete automata. Every automaton A (transducer) whose input/output alphabets consist of p symbols can be associated to a continuous (in fact, 1-Lipschitz) map from padic integers to p integers, the automaton function fA. The p-adic theory (in particular, the p-adic ergodic theory) turned out to be very efficient in a study of properties of automata...
متن کاملAutomata as $p$-adic Dynamical Systems
The automaton transformation of infinite words over alphabet Fp = {0, 1, . . . , p− 1}, where p is a prime number, coincide with the continuous transformation (with respect to the p-adic metric) of a ring Zp of p-adic integers. The objects of the study are non-Archimedean dynamical systems generated by automata mappings on the space Zp. Measure-preservation (with the respect to the Haar measure...
متن کاملNon-Archimedean Ergodic Theory and Pseudorandom Generators
The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions (arithmetic and bitwise logical ones) as continuous functions on the space of 2-adic integers. Within this approach, a PRNG is considered as a dynamical system and is...
متن کامل